儿童健康研究支持孕产妇环境暴露与儿童的出生结果之间的联系。一个共同的目标是确定敏感性的关键窗口 - 妊娠期间与孕产妇暴露与未来结果之间的关联增加的妊娠期。关键窗户的时间和关联的大小可能在不同级别的个体，家庭和邻里特征之间是异质的。使用行政科罗拉多州出生队列，我们​​估计妊娠和出生体重期间每周暴露于细颗粒物（PM2.5）之间的个性化关系。为了实现这一目标，我们提出了一种统计学习方法，将分布式滞后模型和贝叶斯添加剂回归树结合在一起，以估算单个级别的关键窗口，并确定从一组高维的潜在修改因素集中诱导异质性的特征。我们发现PM2.5出生体重关系中异质性的证据，一些母子二元组显示出3倍的出生体重下降3倍，IQR的暴露量增加（5.9至8.5 $ \ MU G/m^3 $ PM2 .5）与人口平均水平相比。具体而言，我们发现对年轻的非西班牙裔母亲的敏感性增加，体重指数更高或受教育程度较低。我们的案例研究是关键窗口的首次精确健康研究。

Applying deep learning concepts from image detection and graph theory has greatly advanced protein-ligand binding affinity prediction, a challenge with enormous ramifications for both drug discovery and protein engineering. We build upon these advances by designing a novel deep learning architecture consisting of a 3-dimensional convolutional neural network utilizing channel-wise attention and two graph convolutional networks utilizing attention-based aggregation of node features. HAC-Net (Hybrid Attention-Based Convolutional Neural Network) obtains state-of-the-art results on the PDBbind v.2016 core set, the most widely recognized benchmark in the field. We extensively assess the generalizability of our model using multiple train-test splits, each of which maximizes differences between either protein structures, protein sequences, or ligand extended-connectivity fingerprints. Furthermore, we perform 10-fold cross-validation with a similarity cutoff between SMILES strings of ligands in the training and test sets, and also evaluate the performance of HAC-Net on lower-quality data. We envision that this model can be extended to a broad range of supervised learning problems related to structure-based biomolecular property prediction. All of our software is available as open source at https://github.com/gregory-kyro/HAC-Net/.

期望与成功采用AI来创新和改善业务之间仍然存在很大的差距。由于深度学习的出现，AI的采用率更为复杂，因为它经常结合大数据和物联网，从而影响数据隐私。现有的框架已经确定需要专注于以人为中心的设计，结合技术和业务/组织的观点。但是，信任仍然是一个关键问题，需要从一开始就设计。拟议的框架从以人为本的设计方法扩展，强调和维持基于该过程的信任。本文提出了负责人工智能（AI）实施的理论框架。拟议的框架强调了敏捷共同创造过程的协同业务技术方法。目的是简化AI的采用过程来通过在整个项目中参与所有利益相关者来创新和改善业务，以便AI技术的设计，开发和部署与人合作而不是孤立。该框架对基于分析文献综述，概念框架设计和从业者的中介专业知识的负责人AI实施提出了新的观点。该框架强调在以人为以人为中心的设计和敏捷发展中建立和维持信任。这种以人为中心的方式与设计原则的隐私相符和启用。该技术和最终用户的创建者正在共同努力，为业务需求和人类特征定制AI解决方案。关于采用AI来协助医院计划的说明性案例研究将证明该拟议框架适用于现实生活中的应用。

医疗图像以高分辨率出现。高分辨率对于在早期发现恶性组织至关重要。然而，该决议在建模远距离依赖性方面提出了挑战。浅变压器消除了这个问题，但它们遭受了二次复杂性。在本文中，我们通过利用线性自我注意近似来解决这种复杂性。通过这种近似，我们提出了一个称为HCT的有效视觉模型，该模型代表高分辨率卷积变压器。HCT以明显降低的成本将变形金刚的优点带入了高分辨率图像。我们使用高分辨率乳房X线摄影数据集评估HCT。HCT明显优于其CNN对应物。此外，我们通过评估其有效的接收场来证明HCT对医学图像的适应性。编码可在https://bit.ly/3ykbhhf上获得。

在本文中，我们建议通过多样式多模态机制（2M）来构建时尚的图像标题模型。我们证明，使用2M，我们可以构建有效的时尚标题器，并且通过识别错误示例的错误输入功能，模型产生的多引用也可以支持解释模型。我们展示了这款2M机制如何用于构建时尚的标题模型，并展示这些模型如何用于提供模型中可能错误的解释。

Variational inference uses optimization, rather than integration, to approximate the marginal likelihood, and thereby the posterior, in a Bayesian model. Thanks to advances in computational scalability made in the last decade, variational inference is now the preferred choice for many high-dimensional models and large datasets. This tutorial introduces variational inference from the parametric perspective that dominates these recent developments, in contrast to the mean-field perspective commonly found in other introductory texts.

Knowledge graphs (KG) have served as the key component of various natural language processing applications. Commonsense knowledge graphs (CKG) are a special type of KG, where entities and relations are composed of free-form text. However, previous works in KG completion and CKG completion suffer from long-tail relations and newly-added relations which do not have many know triples for training. In light of this, few-shot KG completion (FKGC), which requires the strengths of graph representation learning and few-shot learning, has been proposed to challenge the problem of limited annotated data. In this paper, we comprehensively survey previous attempts on such tasks in the form of a series of methods and applications. Specifically, we first introduce FKGC challenges, commonly used KGs, and CKGs. Then we systematically categorize and summarize existing works in terms of the type of KGs and the methods. Finally, we present applications of FKGC models on prediction tasks in different areas and share our thoughts on future research directions of FKGC.

Few Shot Instance Segmentation (FSIS) requires models to detect and segment novel classes with limited several support examples. In this work, we explore a simple yet unified solution for FSIS as well as its incremental variants, and introduce a new framework named Reference Twice (RefT) to fully explore the relationship between support/query features based on a Transformer-like framework. Our key insights are two folds: Firstly, with the aid of support masks, we can generate dynamic class centers more appropriately to re-weight query features. Secondly, we find that support object queries have already encoded key factors after base training. In this way, the query features can be enhanced twice from two aspects, i.e., feature-level and instance-level. In particular, we firstly design a mask-based dynamic weighting module to enhance support features and then propose to link object queries for better calibration via cross-attention. After the above steps, the novel classes can be improved significantly over our strong baseline. Additionally, our new framework can be easily extended to incremental FSIS with minor modification. When benchmarking results on the COCO dataset for FSIS, gFSIS, and iFSIS settings, our method achieves a competitive performance compared to existing approaches across different shots, e.g., we boost nAP by noticeable +8.2/+9.4 over the current state-of-the-art FSIS method for 10/30-shot. We further demonstrate the superiority of our approach on Few Shot Object Detection. Code and model will be available.

Unsupervised domain adaptation (UDA) for semantic segmentation is a promising task freeing people from heavy annotation work. However, domain discrepancies in low-level image statistics and high-level contexts compromise the segmentation performance over the target domain. A key idea to tackle this problem is to perform both image-level and feature-level adaptation jointly. Unfortunately, there is a lack of such unified approaches for UDA tasks in the existing literature. This paper proposes a novel UDA pipeline for semantic segmentation that unifies image-level and feature-level adaptation. Concretely, for image-level domain shifts, we propose a global photometric alignment module and a global texture alignment module that align images in the source and target domains in terms of image-level properties. For feature-level domain shifts, we perform global manifold alignment by projecting pixel features from both domains onto the feature manifold of the source domain; and we further regularize category centers in the source domain through a category-oriented triplet loss and perform target domain consistency regularization over augmented target domain images. Experimental results demonstrate that our pipeline significantly outperforms previous methods. In the commonly tested GTA5$\rightarrow$Cityscapes task, our proposed method using Deeplab V3+ as the backbone surpasses previous SOTA by 8%, achieving 58.2% in mIoU.

The development of social media user stance detection and bot detection methods rely heavily on large-scale and high-quality benchmarks. However, in addition to low annotation quality, existing benchmarks generally have incomplete user relationships, suppressing graph-based account detection research. To address these issues, we propose a Multi-Relational Graph-Based Twitter Account Detection Benchmark (MGTAB), the first standardized graph-based benchmark for account detection. To our knowledge, MGTAB was built based on the largest original data in the field, with over 1.55 million users and 130 million tweets. MGTAB contains 10,199 expert-annotated users and 7 types of relationships, ensuring high-quality annotation and diversified relations. In MGTAB, we extracted the 20 user property features with the greatest information gain and user tweet features as the user features. In addition, we performed a thorough evaluation of MGTAB and other public datasets. Our experiments found that graph-based approaches are generally more effective than feature-based approaches and perform better when introducing multiple relations. By analyzing experiment results, we identify effective approaches for account detection and provide potential future research directions in this field. Our benchmark and standardized evaluation procedures are freely available at: https://github.com/GraphDetec/MGTAB.